Genetic Algorithm with Search Bank Strategies for University Course Timetabling Problem
نویسندگان
چکیده
منابع مشابه
Variable Neighborhood Search Based Algorithm for University Course Timetabling Problem
In this paper a variable neighborhood search approach as a method for solving combinatory optimization problems is presented. A variable neighborhood search based algorithm for solving the problem concerning the university course timetable design has been developed. This algorithm is used to solve the real problem regarding the university course timetable design. It is compared with other algor...
متن کاملSOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملA Guided Search Genetic Algorithm for the University Course Timetabling Problem
The university course timetabling problem is a combinatorial optimisation problem in which a set of events has to be scheduled in time slots and located in suitable rooms. The design of course timetables for academic institutions is a very difficult task because it is an NP-hard problem. This paper proposes a genetic algorithm with a guided search strategy and a local search technique for the u...
متن کاملA Guided Search Non-dominated Sorting Genetic Algorithm for the Multi-Objective University Course Timetabling Problem
The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...
متن کاملA hybrid algorithm of Harmony Search and Bees Algorithm for a University Course Timetabling Problem
This paper is concerned with the development of a new hybrid metaheuristic approach for solving a practical university course timetabling problem in Vietnam. Our hybrid method is a combination of Harmony Search (HS) algorithm and the Bees algorithm. The proposed method has been tested on 14 real-world data instances and compared with some other metaheurisitic approaches, which are Variable Neig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Engineering
سال: 2012
ISSN: 1877-7058
DOI: 10.1016/j.proeng.2012.06.033